- end node representation
- SAP. представление конечного узла
Универсальный англо-русский словарь. Академик.ру. 2011.
end node representation
Смотреть что такое "end node representation" в других словарях:
Linked list — In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the… … Wikipedia
YAML — (IPAEng|ˈjæməl, rhymes with camel ) is a human readable data serialization format that takes concepts from languages such as XML, C, Python, Perl, as well as the format for electronic mail as specified by RFC [http://www.rfc… … Wikipedia
Coxeter–Dynkin diagram — See also: Dynkin diagram Coxeter Dynkin diagrams for the fundamental finite Coxeter groups … Wikipedia
ALGOL 68 — Infobox programming language name = ALGOL 68 paradigm = multi paradigm: concurrent bull; imperative year = 1968, last revised 1973 designer = A. van Wijngaarden, B.J. Mailloux, J.E.L. Peck and C.H.A. Koster, et al. developer = latest release… … Wikipedia
PSTricks — est une extension de LaTeX qui permet d utiliser la majeure partie des possibilités de PostScript. En s appuyant sur PostScript, l extension PSTricks rend possible la réalisation de graphismes très élaborés. Sommaire 1 Exemple élémentaire 2… … Wikipédia en Français
Dynkin diagram — See also: Coxeter–Dynkin diagram Finite Dynkin diagrams Affine (extended) Dynkin diagrams … Wikipedia
sound — sound1 soundable, adj. /sownd/, n. 1. the sensation produced by stimulation of the organs of hearing by vibrations transmitted through the air or other medium. 2. mechanical vibrations transmitted through an elastic medium, traveling in air at a… … Universalium
Sound — /sownd/, n. The, a strait between SW Sweden and Zealand, connecting the Kattegat and the Baltic. 87 mi. (140 km) long; 3 30 mi. (5 48 km) wide. Swedish and Danish, Oresund. * * * I Mechanical disturbance that propagates as a longitudinal wave… … Universalium
Trie — A trie for keys A , to , tea , ted , ten , i , in , and inn . In computer science, a trie, or prefix tree, is an ordered tree data structure that is used to store an associative array where the keys are usually strings. Unlike a binary search… … Wikipedia
Bernoulli number — In mathematics, the Bernoulli numbers Bn are a sequence of rational numbers with deep connections to number theory. They are closely related to the values of the Riemann zeta function at negative integers. There are several conventions for… … Wikipedia
IPv6 address — An Internet Protocol Version 6 address (IPv6 address) is a numerical label that is used to identify a network interface of a computer or other network node participating in an IPv6 enabled computer network. IP addresses serve the purpose of… … Wikipedia
